Solving Measurement Problems with an Answer-Until-Correct Scoring Procedure
نویسندگان
چکیده
منابع مشابه
Ensemble Classifier for Solving Credit Scoring Problems
The goal of this paper is to propose an ensemble classification method for the credit assignment problem. The idea of the proposed method is based on switching class labels techniques. An application of such techniques allows solving two typical data mining problems: a predicament of imbalanced dataset, and an issue of asymmetric cost matrix. The performance of the proposed solution is evaluate...
متن کاملaspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting sys...
متن کاملAdaptive Testing with Equated Number-Correct Scoring
A constrained computerized adaptive testing (CAT) algorithm is presented that automatically equates the number-correct scores on adaptive tests. The algorithm can be used to equate number-correct scores across different administrations of the same adaptive test as well as to an external reference test. The constraints are derived from a set of conditions on item response functions that guarante...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملSolving stable matching problems using answer set programming
Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for finding the stable matchings. To address this issue, we propose an encoding of the SMP using answer set programming (ASP), which can straightforwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Psychological Measurement
سال: 1981
ISSN: 0146-6216,1552-3497
DOI: 10.1177/014662168100500313